منابع مشابه
The Parallel Complexity of Elimination Ordering Procedures
We prove that lexicographic breadthrst search is P-complete and that a variant of the parallel perfect elimination procedure of P. Klein [24] is powerful enough to compute a semi-perfect elimination ordering in sense of [23] if certain induced subgraphs are forbidden. We present an e cient parallel breadth rst search algorithm for all graphs which have no cycle of length greater four and no hou...
متن کاملTricks in dystonia: ordering the complexity.
Sensory tricks are various manoeuvres that can ameliorate dystonia. Common characteristics are well known, but their variety is wide, sensory stimulation is not necessarily the critical feature, and their physiology is unknown. To enumerate the various forms of sensory tricks and describe their nature, research findings and theories that may elucidate their neurophysiologic mechanism, we review...
متن کاملInteger Complexity, Addition Chains, and Well-Ordering
In this dissertation we consider two notions of the “complexity” of a natural number, the first being addition chain length, and the second known simply as “integer complexity”. The integer complexity of n, denoted ‖n‖, is the smallest number of 1’s needed to write n using an arbitrary combination of addition and multiplication. It is known that ‖n‖ ≥ 3 log3 n for all n. We consider the differe...
متن کاملA note on the complexity of the causal ordering problem
In this note we provide a concise report on the complexity of the causal ordering problem, originally introduced by Simon to reason about causal dependencies implicit in systems of mathematical equations. We show that Simon’s classical algorithm to infer causal ordering is NP-Hard—an intractability previously guessed but never proven. We present then a detailed account based on Nayak’s suggeste...
متن کاملOut of Order?: Russian Prefixes, Complexity-based Ordering and Acyclicity
There is a longstanding debate about how to appropriately model the combinability of affixes, especially English suffixes. One widely accepted principle is the notion of so-called selectional restrictions, i.e. grammatical requirements of particular affixes. For example, the suffix -ness can only combine with adjectival bases. Hay (2002) proposed a psycholinguistic approach to affix ordering no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Oz
سال: 2011
ISSN: 0888-7802
DOI: 10.4148/0888-7802.1493